Step of Proof: nil_fseg
11,40
postcript
pdf
Inference at
*
1
I
of proof for Lemma
nil
fseg
:
1.
T
: Type
2.
l
:
T
List
l
= (
l
@ [])
latex
by ((RWO "append_nil_sq" 0)
CollapseTHEN (Auto
))
latex
C
.
Definitions
as
@
bs
,
s
~
t
,
S
T
,
x
:
A
.
B
(
x
)
,
x
:
A
B
(
x
)
,
s
=
t
,
type
List
,
Type
,
Top
,
x
:
A
.
B
(
x
)
,
t
T
,
Void
Lemmas
append
nil
sq
,
member
wf
,
top
wf
origin